Controllability analysis of multi-agent systems using relaxed equitable partitions
نویسندگان
چکیده
This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively ‘reprogrammed’. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main result is a necessary and sufficient condition for the controllability of such systems in terms of the graph topology. In particular, we give a graph theoretic interpretation of the controllability properties through the so-called relaxed equitable partition.
منابع مشابه
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
In this work, we consider the controlled agreement problem for multi-agent networks, where a collection of agents take on leader roles while the remaining agents execute local, consensus-like protocols. Our aim is to identify reflections of graph-theoretic notions on systemtheoretic properties of such systems. In particular, we show how the symmetry structure of the network, characterized in te...
متن کاملStructural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems
The analysis of control of linear multi-agent systems has recently emerged as an important domain that is receiving a lot of interest from a variety of research communities, and consensus plays a fundamental role in this field of study. We will show how using linear algebra techniques can be analyzed the consensus controllability problem for singular multi-agent systems, in which all agents hav...
متن کاملControllability analysis of multi-agent systems with directed and weighted interconnection
In this article, we investigate the controllability of multi-agent systems with leaders as control inputs, where the interconnection is directed and weighted. We employ weight-balanced partition to classify the interconnection graphs, and study the controllable subspaces with given nontrivial weight-balanced partition. We also provide two necessary and sufficient graph conditions on structural ...
متن کاملGraph-theoretic characterisations of structural controllability for multi-agent system with switching topologyy
This article considers the controllability problem for multi-agent systems. In particular, the structural controllability of multi-agent systems under switching topologies is investigated. The structural controllability of multi-agent systems is a generalisation of the traditional controllability concept for dynamical systems, and purely based on the communication topologies among agents. The m...
متن کاملStructural Properties of Multirate Sampled-Data Systems
The application of Networked Control Systems (NCS) in which sensory and control signals are transmitted via shared data communication networks, is growing significantly and these systems have been the subject of research during the last decade. On the other hand, multirate sampled data systems have been investigated since a long time. In this paper, conditions under which a networked control sy...
متن کامل